Synthesis of chiral 2′,3′-pyranone(pyrrolidinone)-fused tryptamines

Chiral pyrano- and pyrrolidino-fused tryptamines were prepared by a diasteroselective trimolecular condensation between indole, Garner's aldehyde and Meldrum's acid, followed by selective functional group transformations.     

Exciton states in In x Ga1−x As/GaAs double quantum wells: Normalized reflection spectra

Il Nuovo Cimento D - Normalized reflection spectra in GaInAs/GaAs quantum wells are shown for two sets of samples with different alloy concentration (x=9% and 18.5%) and well thickness ranging from...     

Quantization of complex Lagrangian submanifolds

Let Λ be a smooth Lagrangian submanifold of a complex symplectic manifold X. We construct twisted simple holonomic modules along Λ in the stack of deformation-quantization modules on X.     

Relations between Types of Reasoning and Computational Representations

This paper examines the idea that particular representations differentially support and enhance different cognitive processes, in particular different types of reasoning. Five case studies were conducted consisting of detailed observations of pairs of middle-school students interacting with a computer-based learning environment. The software environment, called NumberSpeed, deals with kinematics concepts by having students construct various motion scenarios by adjusting numerical motion parameters: position, velocity and acceleration. NumberSpeed provides feedback about the student-specified motion using two representations: the motion representation and the number-lists representation. Two distinct types of reasoning were recognized in students’ learning while interacting with NumberSpeed: (1) model-based reasoning and (2) constraint-based reasoning. These two types of reasoning are characterized in detail and their roles in problem-solving are analyzed. A cross-analysis between the types of reasoning and the use of particular NumberSpeed representations reveals a correlation between type of reasoning and representational choice. These findings are explained by analyzing the representations’ characteristics and the ways they may differentially support and enhance particular types of reasoning.     

A priori estimates for quasilinear degenerate parabolic equations

We prove some maximum and gradient estimates for classical solutions to a wide class of quasilinear degenerate parabolic equations, including first order ones. The proof is elementary and exploits the smallness of the domain in the time direction.

     

An experimental analysis of a population based approach for global optimization

In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see ). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging problems.     

Mathematical and numerical analysis of a simplified time-dependent viscoelastic flow

A time-dependent model corresponding to an Oldroyd-B viscoelastic fluid is considered, the convective terms being disregarded. Global existence in time is proved in Banach spaces provided the data are small enough, using the implicit function theorem and a maximum regularity property for a three fields Stokes problem. A finite element discretization in space is then proposed. Existence of the numerical solution is proved for small data, so as a priori error estimates, using again an implicit function theorem. Supported by the Swiss National Science Foundation. Fellowship PBEL2–114311.     

Synthesis of potential selective cox‐2 enzyme inhibitors derived from ethyl ester of 2‐isothiocyanato‐5‐phenyl‐3‐thiophenecarboxylic acid

Derivatives containing the thieno[2,3‐d]pyrimidin‐4‐one system, potential selective COX‐2 inhibitors, were prepared starting from ethyl ester of 2‐isothiocyanato‐5‐phenyl‐3‐thiophenecarboxylic acid ( 2 ); their structural elucidation is also reported.     

Difference Families in Z2d+1⊕Z2d+1 and Infinite Translation Designs in Z⊕Z

We analyse 3-subset difference families of Z_2d+1⊕Z_2d+1 arising as reductions (mod 2d+1) of particular families of 3-subsets of Z⊕Z. The latter structures, namely perfect d-families, can be viewed as 2-dimensional analogues of difference triangle sets having the least scope. Indeed, every perfect d-family is a set of base blocks which, under the natural action of the translation group Z⊕Z, cover all edges {(x,y),(x′,y′)} such that |x−x′|, |y−y′|≤d. In particular, such a family realises a translation invariant (G,K₃)-design, where V(G)=Z⊕Z and the edges satisfy the above constraint. For that reason, we regard perfect families as part of the hereby defined translation designs, which comprise and slightly generalise many structures already existing in the literature. The geometric context allows some suggestive additional definitions. The main result of the paper is the construction of two infinite classes of d-families. Furthermore, we provide two sporadic examples and show that a d-family may exist only if d≡0,3,8,11 (mod 12).